Solving systems of linear algebraic equations by preconditioning on graphics processing units
نویسندگان
چکیده
منابع مشابه
Algebraic Solving of Complex Interval Linear Systems by Limiting Factors
In this work, we propose a simple method for obtaining the algebraic solution of a complex interval linear system where coefficient matrix is a complex matrix and the right-hand-side vector is a complex interval vector. We first use a complex interval version of the Doolittle decomposition method and then we restrict the Doolittle's solution, by complex limiting factors, to achieve a complex in...
متن کاملSolving the Euler Equations on Graphics Processing Units
The paper describes how one can use commodity graphics cards (GPUs) as a high-performance parallel computer to simulate the dynamics of ideal gases in two and three spatial dimensions. The dynamics is described by the Euler equations, and numerical approximations are computed using state-of-the-art high-resolution finite-volume schemes. These schemes are based upon an explicit time discretisati...
متن کاملA Parallel Algebraic Multigrid Solver on Graphics Processing Units
The paper presents a multi-GPU implementation of the preconditioned conjugate gradient algorithm with an algebraic multigrid preconditioner (PCG-AMG) for an elliptic model problem on a 3D unstructured grid. An efficient parallel sparse matrix-vector multiplication scheme underlying the PCG-AMG algorithm is presented for the manycore GPU architecture. A performance comparison of the parallel sol...
متن کاملSolving Systems of Linear Algebraic Equations Using Quasirandom Numbers
In this paper we analyze a quasi-Monte Carlo method for solving systems of linear algebraic equations. It is well known that the convergence of Monte Carlo methods for numerical integration can often be improved by replacing pseudorandom numbers with more uniformly distributed numbers known as quasirandom numbers. Here the convergence of a Monte Carlo method for solving systems of linear algebr...
متن کاملSolving Systems of Linear Diophantine Equations: An Algebraic Approach
We describe through an algebraic and geometrical study, a new method for solving systems of linear diophantine equations. This approach yields an algorithm which is intrinsically parallel. In addition to the algorithm, we give a geometrical interpretation of the satissability of an homogeneous system, as well as upper bounds on height and length of all minimal solutions of such a system. We als...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science and Education of the Bauman MSTU
سال: 2013
ISSN: 1994-0408
DOI: 10.7463/0113.0525190